Investigation of Sparsifying Transforms for Compressed Sensing in MRI Reconstruction

نویسندگان

  • C. Baker
  • K. King
  • D. Liang
  • L. Ying
چکیده

Introduction Compressed Sensing (CS) image reconstruction requires the image of interest to be sparse or compressible under some transform and the encoding matrix to be incoherent with the sparsifying transform. With Fourier encoding in MRI, the level of sparsity and incoherence achieved by the transform affects the under-sampling that can be performed (1,2). The most desirable transforms achieve a high level of compressibility for the images to be reconstructed and a high level of incoherence for Fourier encoding. Wavelets have been proven to be incoherent with the Fourier basis and also shown to be a good sparsifying transform (2,3). This work investigates contourlets (4) and the discrete cosine transform (DCT) as transforms for CS MRI reconstruction and compares them with the widely used wavelet transform. Methods Both the contourlet, a very special non-orthogonal transform, and the classical DCT are known to be effective in image compression. To evaluate their effectiveness in CS, both transforms were used as the sparsifying transforms for CS reconstruction. Specifically, the image vector m was solved for by minimizing ||Wm||1 under the constraint Em = y, where E is the Fourier (in the case of single-channel) or sensitivity (in the case of multi-channel) encoding matrix, y is the reduced k-space data, and W is the chosen sparsifying transform. The reduced k-space data were obtained by pseudo-randomly under-sampling the fully acquired phase encodings with variable density according to the CS principle (3). The constrained minimization was performed using a nonlinear conjugate gradient algorithm (5). For the contourlet as a sparsifying transform, a slightly over-complete basis was used to transform the entire image, producing at most 4/3 the number of coefficients as the image size. The DCT used can have an over-complete basis and is used to transform small and overlapping patches of the image in a way similar to references 6 and 7. An Orthogonal Matching Pursuit (OMP) algorithm is used to compute the coefficients θ for the image m with the over-complete DCT basis Ψ by minimizing ||θ||0 under the constraint Ψ θ = m (7). CS reconstruction with the wavelet transform as the sparsifying transform was also performed on the image as a whole. An in-depth search and comparison of a vast number of different settings such as filters and decomposition levels were performed to identify good parameters to use for each data set and testing scenario. All reconstructed images were evaluated by contrasting with the fully sampled reconstructions. Quantitative and qualitative analyses were performed by observing changes in feature structure, artifacts, noise, and mean-squared-error (MSE). Additionally, observations of different algorithm parameters such as, number of iterations, and gradient calculation approaches were also considered. Several image datasets were tested with different features and contrast, to determine whether contourlets or DCT on patches could outperform wavelets for some types of MRI. To make a fair comparison, no total variation (TV) was included in the minimization, although it can improve the image quality. Results The CS reconstruction results with different transforms were compared by visually inspecting the images after a proper number of iterations of the non-linear CG algorithm. An eight-channel dataset and a single channel dataset of a brain with T1-weighting were chosen as the test data. A reduction factor of two was used in the single channel dataset and a reduction factor of 3.3 was used for the eight-channel dataset. Figure 1 and 2 show the reconstructed images. CS with the contourlet transform performs similarly to CS with the wavelet transform; the visual comparisons between the two reconstructed images show very minimal differences in structure, artifact suppression and noise. In contrast, CS with the DCT on patches was able to remove more artifacts caused by the under-sampling and reduce more noise across the image, while still preserving the image details. Quantitatively, the DCT on patches had a 15-25% improvement in MSE measurement compared with the wavelet and contourlet transforms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combined sparsifying transforms for compressed sensing MRI

In traditional compressed sensing MRI methods, single sparsifying transform limits the reconstruction quality because it cannot sparsely represent all types of image features. Based on the principle of basis pursuit, a method that combines sparsifying transforms to improve the sparsity of images is proposed. Simulation results demonstrate that the proposed method can well recover different type...

متن کامل

Compressed sensing MRI with combined sparsifying transforms and smoothed l0 norm minimization

Undersampling the k-space is an efficient way to speed up the magnetic resonance imaging (MRI). Recently emerged compressed sensing MRI shows promising results. However, most of them only enforce the sparsity of images in single transform, e.g. total variation, wavelet, etc. In this paper, based on the principle of basis pursuit, we propose a new framework to combine sparsifying transforms in c...

متن کامل

Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to MRI

Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing exploits the sparsity of images or image patches in a transform domain or synthesis dictionary to reconstruct images from undersampled measurements. In this...

متن کامل

A generalized motion compensated compressed sensing scheme for highly accelerated myocardial perfusion MRI

Background Compressed sensing (CS) based myocardial perfusion MRI methods that promote sparsity in temporal transform domains such as temporal Fourier (x-f), temporal PCA (x-PCA), temporal total variation (x-TV) have shown promise to accelerate breath held scans [Otazo et al, 10, Pedersen et al, 09, Adluru et al, 07]. However the performances of these schemes can degrade in the presence of moti...

متن کامل

Unmanned aerial vehicle field sampling and antenna pattern reconstruction using Bayesian compressed sensing

Antenna 3D pattern measurement can be a tedious and time consuming task even for antennas with manageable sizes inside anechoic chambers. Performing onsite measurements by scanning the whole 4π [sr] solid angle around the antenna under test (AUT) is more complicated. In this paper, with the aim of minimum duration of flight, a test scenario using unmanned aerial vehicles (UAV) is proposed. A pr...

متن کامل

Magnetic resonance image reconstruction using trained geometric directions in 2D redundant wavelets domain and non-convex optimization.

Reducing scanning time is significantly important for MRI. Compressed sensing has shown promising results by undersampling the k-space data to speed up imaging. Sparsity of an image plays an important role in compressed sensing MRI to reduce the image artifacts. Recently, the method of patch-based directional wavelets (PBDW) which trains geometric directions from undersampled data has been prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008